Complexity of independent set reconfigurability problems
نویسندگان
چکیده
منابع مشابه
Complexity of independent set reconfigurability problems
We study problems of reconfigurability of independent sets in graphs. We consider three different models (token jumping, token sliding, and token addition and removal) and analyze relationships between them. We prove that independent set reconfigurability in perfect graphs (under any of the three models) generalizes the shortest path reconfigurability problem in general graphs and is therefore ...
متن کاملQuantum Complexity Bounds of Independent Set Problems
We give quantum algorithms and quantum lower bounds for computing a maximal and a maximum independent. We present applications of these algorithms for some graph problems. Our results improve the best classical complexity bounds for the corresponding problems. Quantum Graph Algorithms We consider two models for the represention of graphs G = (V,E) with V = {v1, . . . , vn}: •Adjacency matrix model
متن کاملQuantum Complexity Bounds for Independent Set Problems
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these algorithms for some graph problems. Our results improve the best classical complexity bounds for the corresponding problems.
متن کاملParameterized Extension Complexity of Independent Set
Let G be a graph on n vertices and STABk(G) be the convex hull of characteristic vectors of its independent sets of size at most k. It is known that optimizing over STABk(G) is W [1]-hard and is FPT tractable for graphs of bounded expansion. We show analogous results for the extension complexity of STABk(G). In particular, we show that when G is a graph from a class of bounded expansion then xc...
متن کاملOn the complexity of dominating set problems
The minimum all-ones problem and the connected odd dominating set problem were shown to be NP-complete in different papers for general graphs, while they are solvable in linear time (or trivial) for trees, unicyclic graphs, and series-parallel graphs. The complexity of both problems when restricted to bipartite graphs was raised as an open question. Here we solve both problems. For this purpose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.03.004